On the Mitchell and Rudin-Kiesler orderings of ultrafilters

نویسنده

  • Moti Gitik
چکیده

The purpose of this paper is to study the consistency correlations between the Rudin-Kiesler and the Mitchell orderings of ultrafilters. There is no direct connection between these two orderings. Thus, in general, U 6nK V does not imply UCIV or converse. Moreover, if U cRK V and UaV, then there exists a p-measurable cardinal. It is easy to construct a Rudin-Kiesler increasing sequence of length o from one measurable cardinal, although it is not enough for the Mitchell increasing sequence even of length 2. But for a Rudin-Kiesler sequence of length w + 1 one measurable is not enough as was shown by Kanamori [5] and Mitchell [13]. On the other hand, Mitchell [13] constructed a Rudin-Kiesler sequence of length o2 from a Mitchell sequence of length 2. We are going to study the following equation: Con(a-increasing sequence of length x) iff Con( +,-increasing sequence of length y). Similar equations for Rudin-Kiesler sequences of Pand Q-points are also considered. Under the assumption “there is no inner model satisfying 3~ O(K) = K++" the solutions to these equation are given. It generalizes [13] which provides a partial solution for the Q-points case. Some related questions about the number of skies, constellations and existence of non-closed elementary embeddings will be considered. These notions were introduced and studied by Kanamori [5] and recently by Sureson [18]. It is worth noting that the Mitchell ordering or more precisely its rank function “0” is widely used as a scale for measuring the strength of propositions. So the above equations are actually considered in the form “Con+ O(K) = X) iff Con( +,-increasing sequence of length y)“. We are using some ideas and techniques of Mitchell [ll-141 and [l-3]. The paper is organized as follows. In Section 1 we find bounds on the length of Rudin-Kiesler increasing sequences of Q-points. These bounds depend only on the core model with the maximal sequence of ultrafilters. In Section 2 using the forcing arguments it is shown that the bounds of Section 1 are exact. The following theorem is proved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some constructions of ultrafilters over a measurable cardinal

Some non-normal κ−complete ultrafilters over a measurable κ with special properties are constructed. Questions by A. Kanamori [4] about infinite Rudin-Frolik sequences, discreteness and products are answered.

متن کامل

Continuous and Other Finitely Generated Canonical Cofinal Maps on Ultrafilters

This paper concentrates on the existence of canonical cofinal maps of three types: continuous, generated by finitary monotone end-extension preserving maps, and generated by monotone finitary maps. The main theorems prove that every monotone cofinal map on an ultrafilter of a certain class of ultrafilters is actually canonical when restricted to some filter base. These theorems are then applied...

متن کامل

Cofinal types of ultrafilters

We study Tukey types of ultrafilters on ω, focusing on the question of when Tukey reducibility is equivalent to Rudin-Keisler reducibility. We give several conditions under which this equivalence holds. We show that there are only c many ultrafilters that are Tukey below any basically generated ultrafilter. The class of basically generated ultrafilters includes all known ultrafilters that are n...

متن کامل

Hyperfiniteness and Borel Combinatorics

We study the relationship between hyperfiniteness and problems in Borel graph combinatorics by adapting game-theoretic techniques introduced by Marks to the hyperfinite setting. We compute the possible Borel chromatic numbers and edge chromatic numbers of bounded degree acyclic hyperfinite Borel graphs and use this to answer a question of Kechris and Marks about the relationship between Borel c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 39  شماره 

صفحات  -

تاریخ انتشار 1988